Lozhkin Sergey Andreevich

 

 

WORK ADDRESS
Lomonosov Moscow State University
GSP-1, Leninskie Gory, Moscow, 119991, Lomonosov Moscow State University, 1, bldg. 52, 2nd academic building, Faculty of Computational Mathematics and Cybernetics
Phone: +7 (495) 939-30-10

ACADEMIC QUALIFICATION
Candidate of Physical and Mathematical Sciences (1979). Thesis topic: “Realization of Boolean functions by circuits of functional elements with delays” (supervisor - Lupanov O.B).
Doctor of Physical and Mathematical Sciences (1998). Thesis topic: “Asymptotic estimates of a high degree of accuracy for the complexity of control systems”.

POSITIONS HELD
He has been working at Moscow State University since 1978: Assistant (1978-1988), Associate Professor (1988-1998), Professor (since 1999) at the Department of Mathematical Cybernetics of the Faculty of Computational Mathematics and Cybernetics, Moscow State University, Vice-Dean for Science and Research at the Faculty of Computational Mathematics and Cybernetics (from 2000).

RESEARCH INTERESTS
• cybernetics
• mathematical models and methods

ACADEMIC AWARDS AND GRANTS
Honored Professor of Moscow State University (2009).
Awarded with a medal “In Commemoration of the 850th Anniversary of Moscow” (1997).

TRAINING OF HIGHLY QUALIFIED PERSONNEL
14 Candidates of Sciences were trained.

MEMBERSHIP IN EDITORIAL BOARDS OF JOURNALS
Member of the Editorial Board of the journal “University Proceedings. Volga Region. Physical and Mathematical Sciences”

TOTAL NUMBER OF PUBLICATIONS: over 100

MAIN PUBLICATIONS
1. Elements of Graph, Schemes and Automata Theory (textbook). Moscow: The Faculty of Computational Mathematics and Cybernetics MSU, 2000. 60 p. (co-author Alekseev V.B.).
2. Lectures on Elementary Cybernetics (textbook). Moscow: The Faculty of Computational Mathematics and Cybernetics MSU, 2004. 256 p.
3. Exact bounds on the complexity of circuits of different types. Mathematical Problems of Cybernetics, no. 6. Moscow: Nauka, 1996, pp. 189-214.
4. On the depth of Boolean functions in an arbitrary complete basis. Vestnik Moskovskogo Unviersiteta, ser. 1: Matematika. Mekhanika, 1996, no. 2, pp. 80-82.
5. On completeness and closed classes of Boolean functions with direct and iterative variables. Vestnik Moskovskogo Unviersiteta, ser. 15: Vychislitelnaya Matematika i Kibenetika, 1999, no. 3, p. 35-41.
6. On the asymptotics of the complexity of a universal cellular contact multipole. Vestnik Moskovskogo Unviersiteta, ser. 15: Vychislitelnaya Matematika i Kibenetika, 2005, no. 4, pp. 30-38 (co-author Evdokimova T.N.).
7. On minimal π-circuits of closing contacts for symmetric functions with threshold 2. Discrete Mathematics and Applications, 2005, vol. 17, no. 4, pp. 108-110.
8. On the implementation of BDD Boolean functions embedded in the unit cube. Vestnik Moskovskogo Unviersiteta., ser. 15: Vychislitelnaya Matematika i Kibenetika, 2006, no. 4, pp. 29-36 (co-author Sedelev O.B.).
9. Synthesis of formulas whose complexity and depth do not exceed the asymptotically best estimates of high degree of accuracy. Vestnik Moskovskogo Unviersiteta, ser. 1: Matematika. Mekhanika, 2007, no. 3, pp. 19-25.
10. Integration of logic synthesis with binding to library in system Integro // Problems of Perspective Micro- and Nanoelectronic Systems Development - 2008. Proceedings / edited by A. Stempkovsky. Moscow: IPPM RAS, 2008, pp. 18-23 (co-authors D. S. Romanov, A. N. Gotmanov, E. A. Popov, A. E. Shiganov).
11. On the complexity of a multiplexer function in the class of π-circuits // Uchenye Zapiski Kazanskogo Universiteta, Seriya Fiziko-Matematicheskie Nauki, vol. 151, no. 2, 2009, p. 98-106 (co-author Vlasov V. N.).

 

 

Дата создания: 27.11.2020 14:41
Дата обновления: 27.11.2020 14:41